Parallel algorithms for arrangements

Parallel Algorithms for Arrangements 1

We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(log n log∗ n) time and n2/ log n processors. We generalize this to obtain an O(log n log∗ n)-time algorithm using nd / log n processors for solving the problem in d dimensions. We also give a randomized algorithm for th...

Intersection and decomposition algorithms for planar arrangements

Geometric Arrangements: Substructures and Algorithms

In this thesis we study a variety of problems in computational and combinatorial geometry, which involve arrangements of geometric objects in the plane and in higher dimensions. Some of these problems involve the design and analysis of algorithms on arrangements and related structures, while others establish combinatorial bounds on the complexity of various substructures in arrangements. Inform...

Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)

Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...

Parallel Algorithms for Hierarchical

Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O(n 2) algorithms are known for this problem 3, 4, 10, 18]. This paper reviews important results for sequential algorithms and describes previous work on parallel algorithms for hierarchical clustering. Parallel algorithms to perform hierarchical clustering using several dist...